IF-logic and Skolemization: falsity conditions for IF-formulas. section: Game Logics
نویسندگان
چکیده
GTS associates with every IF-sentence φ and suitable modelM a semantical game GM(φ), played by two players, one in the role of Verifier and one in the role of Falsifier. Moves in the game are choices for domain elements as assignments for the variables bound by the quantifiers ∃ (move for player in the role of Verifier) and ∀ (move for the player in the role of Falsifier) and choices for ‘left’ or ‘right’, associated with the connectives ∨ and ∧ (move for Verifier and Falsifier respectively). The negation sign ∼makes the two players change roles.
منابع مشابه
Skolemization in intermediate logics with the finite model property
An alternative Skolemization method, which removes strong quantifiers from formulas, is presented that is sound and complete with respect to intermediate predicate logics with the finite model property. For logics without constant domains the method makes use of an existence predicate, while for logics with constant domains no additional predicate is necessary. In both cases an analogue of Hebr...
متن کاملGödel-Dummett Predicate Logics and Axioms of Prenexability
Gödel-Dummett logic in general is a multi-valued logic where a truth value of a formula can be any number from the real interval [0, 1] and where implication → is evaluated via the Gödel implication function. As to truth values, 0 (falsity) and 1 (truth) are the extremal truth values whereas the remaining truth values are called intermediate. Gödel implication function ⇒ is defined as follows: ...
متن کاملSkolemization Modulo Theories
Combining classical automated theorem proving techniques with theory based reasoning, such as satisfiability modulo theories, is a new approach to first-order reasoning modulo theories. Skolemization is a classical technique used to transform first-order formulas into equisatisfiable form. We show how Skolemization can benefit from a new satisfiability modulo theories based simplification techn...
متن کاملHerbrand Theorems for Substructural Logics
Herbrand and Skolemization theorems are obtained for a broad family of first-order substructural logics. These logics typically lack equivalent prenex forms, a deduction theorem, and reductions of semantic consequence to satisfiability. The Herbrand and Skolemization theorems therefore take various forms, applying either to the left or right of the consequence relation, and to restricted classe...
متن کاملGames and Logics of Knowledge for Multi-agent Systems
New types of knowledge constructions in epistemic logic are defined, whose semantics is given by a combination of game-theoretic notions and modal semantics. A new notion of knowledge introduced in this framework is focussed knowledge, which arises from the game-theoretic phenomenon of imperfect information in quantified versions of epistemic logics. This notion is shown to be useful in knowled...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002